TSTP Solution File: NUM740^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM740^4 : TPTP v8.1.2. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:56:31 EDT 2024
% Result : Theorem 0.44s 0.75s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 39
% Syntax : Number of formulae : 72 ( 38 unt; 24 typ; 0 def)
% Number of atoms : 177 ( 33 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 573 ( 25 ~; 11 |; 5 &; 501 @)
% ( 0 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 50 ( 50 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 24 usr; 6 con; 0-3 aty)
% Number of variables : 79 ( 68 ^ 11 !; 0 ?; 79 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_23,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
in: $i > $i > $o ).
thf(decl_61,type,
imp: $o > $o > $o ).
thf(decl_62,type,
d_not: $o > $o ).
thf(decl_67,type,
l_or: $o > $o > $o ).
thf(decl_77,type,
e_is: $i > $i > $i > $o ).
thf(decl_123,type,
nat: $i ).
thf(decl_124,type,
n_is: $i > $i > $o ).
thf(decl_127,type,
n_some: ( $i > $o ) > $o ).
thf(decl_147,type,
diffprop: $i > $i > $i > $o ).
thf(decl_148,type,
d_29_ii: $i > $i > $o ).
thf(decl_149,type,
iii: $i > $i > $o ).
thf(decl_162,type,
n_ts: $i > $i > $i ).
thf(decl_189,type,
frac: $i ).
thf(decl_191,type,
num: $i > $i ).
thf(decl_192,type,
den: $i > $i ).
thf(decl_193,type,
n_eq: $i > $i > $o ).
thf(decl_194,type,
moref: $i > $i > $o ).
thf(decl_195,type,
lessf: $i > $i > $o ).
thf(decl_196,type,
moreq: $i > $i > $o ).
thf(decl_197,type,
lesseq: $i > $i > $o ).
thf(decl_198,type,
esk1_0: $i ).
thf(decl_199,type,
esk2_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_imp) ).
thf(def_moref,axiom,
( moref
= ( ^ [X1: $i,X449: $i] : ( d_29_ii @ ( n_ts @ ( num @ X1 ) @ ( den @ X449 ) ) @ ( n_ts @ ( num @ X449 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_moref) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_d_29_ii) ).
thf(def_n_eq,axiom,
( n_eq
= ( ^ [X1: $i,X436: $i] : ( n_is @ ( n_ts @ ( num @ X1 ) @ ( den @ X436 ) ) @ ( n_ts @ ( num @ X436 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_n_eq) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_l_or) ).
thf(def_lessf,axiom,
( lessf
= ( ^ [X1: $i,X450: $i] : ( iii @ ( n_ts @ ( num @ X1 ) @ ( den @ X450 ) ) @ ( n_ts @ ( num @ X450 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_lessf) ).
thf(def_iii,axiom,
( iii
= ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_iii) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_is_of) ).
thf(def_moreq,axiom,
( moreq
= ( ^ [X1: $i,X465: $i] : ( l_or @ ( moref @ X1 @ X465 ) @ ( n_eq @ X1 @ X465 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_moreq) ).
thf(def_n_is,axiom,
( n_is
= ( e_is @ nat ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_n_is) ).
thf(def_lesseq,axiom,
( lesseq
= ( ^ [X1: $i,X466: $i] : ( l_or @ ( lessf @ X1 @ X466 ) @ ( n_eq @ X1 @ X466 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',def_lesseq) ).
thf(satz48,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X487: $i] : ( in @ X487 @ frac )
@ ^ [X488: $i] :
( ( moreq @ X1 @ X488 )
=> ( lesseq @ X488 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',satz48) ).
thf(satz38,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X437: $i] : ( in @ X437 @ frac )
@ ^ [X438: $i] :
( ( n_eq @ X1 @ X438 )
=> ( n_eq @ X438 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p',satz38) ).
thf(c_0_15,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_16,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_17,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moref]) ).
thf(c_0_18,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_19,plain,
( n_eq
= ( ^ [Z0: $i,Z1: $i] : ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_n_eq]) ).
thf(c_0_20,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_21,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_22,plain,
( lessf
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_lessf]) ).
thf(c_0_23,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ Z1 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_iii]) ).
thf(c_0_24,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_25,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_26,plain,
( moreq
= ( ^ [Z0: $i,Z1: $i] :
( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moreq]) ).
thf(c_0_27,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_28,plain,
( n_eq
= ( ^ [Z0: $i,Z1: $i] : ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_19,def_n_is]) ).
thf(c_0_29,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_16]),c_0_21]) ).
thf(c_0_30,plain,
( lesseq
= ( ^ [Z0: $i,Z1: $i] :
( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_lesseq]) ).
thf(c_0_31,plain,
( lessf
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_32,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_33,plain,
( moreq
= ( ^ [Z0: $i,Z1: $i] :
( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]) ).
thf(c_0_34,plain,
( lesseq
= ( ^ [Z0: $i,Z1: $i] :
( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_30,c_0_31]),c_0_28]),c_0_29]) ).
thf(c_0_35,negated_conjecture,
~ ! [X527: $i] :
( ( in @ X527 @ frac )
=> ! [X526: $i] :
( ( in @ X526 @ frac )
=> ( ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X527 ) @ ( den @ X526 ) ) @ ( n_ts @ ( num @ X526 ) @ ( den @ X527 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ X527 ) @ ( den @ X526 ) ) @ ( n_ts @ ( num @ X526 ) @ ( den @ X527 ) ) ) )
=> ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X527 ) @ ( den @ X526 ) ) @ ( n_ts @ ( num @ X526 ) @ ( den @ X527 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ X526 ) @ ( den @ X527 ) ) @ ( n_ts @ ( num @ X527 ) @ ( den @ X526 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz48])]),c_0_32]),c_0_33]),c_0_34]) ).
thf(c_0_36,negated_conjecture,
( ( in @ esk1_0 @ frac )
& ( in @ esk2_0 @ frac )
& ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
| ( e_is @ nat @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
& ( $true
| ( e_is @ nat @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
& ( ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
| ~ $true )
& ~ ( e_is @ nat @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])])]) ).
thf(c_0_37,plain,
! [X555: $i] :
( ( in @ X555 @ frac )
=> ! [X554: $i] :
( ( in @ X554 @ frac )
=> ( ( e_is @ nat @ ( n_ts @ ( num @ X555 ) @ ( den @ X554 ) ) @ ( n_ts @ ( num @ X554 ) @ ( den @ X555 ) ) )
=> ( e_is @ nat @ ( n_ts @ ( num @ X554 ) @ ( den @ X555 ) ) @ ( n_ts @ ( num @ X555 ) @ ( den @ X554 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz38]),c_0_32]),c_0_28]) ).
thf(c_0_38,negated_conjecture,
( ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_39,plain,
! [X889: $i,X890: $i] :
( ~ ( in @ X889 @ frac )
| ~ ( in @ X890 @ frac )
| ~ ( e_is @ nat @ ( n_ts @ ( num @ X889 ) @ ( den @ X890 ) ) @ ( n_ts @ ( num @ X890 ) @ ( den @ X889 ) ) )
| ( e_is @ nat @ ( n_ts @ ( num @ X890 ) @ ( den @ X889 ) ) @ ( n_ts @ ( num @ X889 ) @ ( den @ X890 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])]) ).
thf(c_0_40,negated_conjecture,
( ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
| ( e_is @ nat @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_41,negated_conjecture,
~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) ),
inference(cn,[status(thm)],[c_0_38]) ).
thf(c_0_42,plain,
! [X4: $i,X1: $i] :
( ( e_is @ nat @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) )
| ~ ( in @ X1 @ frac )
| ~ ( in @ X4 @ frac )
| ~ ( e_is @ nat @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
thf(c_0_43,negated_conjecture,
e_is @ nat @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ),
inference(sr,[status(thm)],[c_0_40,c_0_41]) ).
thf(c_0_44,negated_conjecture,
in @ esk2_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_45,negated_conjecture,
in @ esk1_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_46,negated_conjecture,
~ ( e_is @ nat @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.19/0.18 % Problem : NUM740^4 : TPTP v8.1.2. Released v7.1.0.
% 0.19/0.19 % Command : run_E %s %d THM
% 0.20/0.40 % Computer : n014.cluster.edu
% 0.20/0.40 % Model : x86_64 x86_64
% 0.20/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.40 % Memory : 8042.1875MB
% 0.20/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.40 % CPULimit : 300
% 0.20/0.40 % WCLimit : 300
% 0.20/0.40 % DateTime : Fri May 3 09:17:32 EDT 2024
% 0.20/0.41 % CPUTime :
% 0.38/0.60 Running higher-order theorem proving
% 0.38/0.60 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.lPSvCgA0Ap/E---3.1_29435.p
% 0.44/0.75 # Version: 3.1.0-ho
% 0.44/0.75 # Preprocessing class: HSLMSMSMLLLCHSA.
% 0.44/0.75 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.75 # Starting pre_casc_4 with 1200s (4) cores
% 0.44/0.75 # Starting full_lambda_6 with 300s (1) cores
% 0.44/0.75 # Starting sh10 with 300s (1) cores
% 0.44/0.75 # Starting post_as_ho9 with 300s (1) cores
% 0.44/0.75 # Starting post_as_ho8 with 300s (1) cores
% 0.44/0.75 # pre_casc_4 with pid 29569 completed with status 0
% 0.44/0.75 # Result found by pre_casc_4
% 0.44/0.75 # Preprocessing class: HSLMSMSMLLLCHSA.
% 0.44/0.75 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.75 # Starting pre_casc_4 with 1200s (4) cores
% 0.44/0.75 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.44/0.75 # Search class: HGHSM-FSLM31-DHSMMFBN
% 0.44/0.75 # partial match(2): HGHSM-FSLM31-DHSFFFBN
% 0.44/0.75 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.44/0.75 # Starting sh1l with 357s (1) cores
% 0.44/0.75 # Starting pre_casc_4 with 121s (1) cores
% 0.44/0.75 # Starting new_bool_8 with 210s (1) cores
% 0.44/0.75 # Starting new_bool_9 with 208s (1) cores
% 0.44/0.75 # sh1l with pid 29576 completed with status 0
% 0.44/0.75 # Result found by sh1l
% 0.44/0.75 # Preprocessing class: HSLMSMSMLLLCHSA.
% 0.44/0.75 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.75 # Starting pre_casc_4 with 1200s (4) cores
% 0.44/0.75 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.44/0.75 # Search class: HGHSM-FSLM31-DHSMMFBN
% 0.44/0.75 # partial match(2): HGHSM-FSLM31-DHSFFFBN
% 0.44/0.75 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.44/0.75 # Starting sh1l with 357s (1) cores
% 0.44/0.75 # Preprocessing time : 0.019 s
% 0.44/0.75
% 0.44/0.75 # Proof found!
% 0.44/0.75 # SZS status Theorem
% 0.44/0.75 # SZS output start CNFRefutation
% See solution above
% 0.44/0.75 # Parsed axioms : 562
% 0.44/0.75 # Removed by relevancy pruning/SinE : 395
% 0.44/0.75 # Initial clauses : 284
% 0.44/0.75 # Removed in clause preprocessing : 81
% 0.44/0.75 # Initial clauses in saturation : 203
% 0.44/0.75 # Processed clauses : 128
% 0.44/0.75 # ...of these trivial : 0
% 0.44/0.75 # ...subsumed : 33
% 0.44/0.75 # ...remaining for further processing : 95
% 0.44/0.75 # Other redundant clauses eliminated : 0
% 0.44/0.75 # Clauses deleted for lack of memory : 0
% 0.44/0.75 # Backward-subsumed : 1
% 0.44/0.75 # Backward-rewritten : 0
% 0.44/0.75 # Generated clauses : 371
% 0.44/0.75 # ...of the previous two non-redundant : 343
% 0.44/0.75 # ...aggressively subsumed : 0
% 0.44/0.75 # Contextual simplify-reflections : 1
% 0.44/0.75 # Paramodulations : 345
% 0.44/0.75 # Factorizations : 0
% 0.44/0.75 # NegExts : 0
% 0.44/0.75 # Equation resolutions : 2
% 0.44/0.75 # Disequality decompositions : 0
% 0.44/0.75 # Total rewrite steps : 60
% 0.44/0.75 # ...of those cached : 55
% 0.44/0.75 # Propositional unsat checks : 0
% 0.44/0.75 # Propositional check models : 0
% 0.44/0.75 # Propositional check unsatisfiable : 0
% 0.44/0.75 # Propositional clauses : 0
% 0.44/0.75 # Propositional clauses after purity: 0
% 0.44/0.75 # Propositional unsat core size : 0
% 0.44/0.75 # Propositional preprocessing time : 0.000
% 0.44/0.75 # Propositional encoding time : 0.000
% 0.44/0.75 # Propositional solver time : 0.000
% 0.44/0.75 # Success case prop preproc time : 0.000
% 0.44/0.75 # Success case prop encoding time : 0.000
% 0.44/0.75 # Success case prop solver time : 0.000
% 0.44/0.75 # Current number of processed clauses : 94
% 0.44/0.75 # Positive orientable unit clauses : 16
% 0.44/0.75 # Positive unorientable unit clauses: 2
% 0.44/0.75 # Negative unit clauses : 4
% 0.44/0.75 # Non-unit-clauses : 72
% 0.44/0.75 # Current number of unprocessed clauses: 416
% 0.44/0.75 # ...number of literals in the above : 2204
% 0.44/0.75 # Current number of archived formulas : 0
% 0.44/0.75 # Current number of archived clauses : 1
% 0.44/0.75 # Clause-clause subsumption calls (NU) : 2793
% 0.44/0.75 # Rec. Clause-clause subsumption calls : 655
% 0.44/0.75 # Non-unit clause-clause subsumptions : 35
% 0.44/0.75 # Unit Clause-clause subsumption calls : 8
% 0.44/0.75 # Rewrite failures with RHS unbound : 0
% 0.44/0.75 # BW rewrite match attempts : 3
% 0.44/0.75 # BW rewrite match successes : 2
% 0.44/0.75 # Condensation attempts : 0
% 0.44/0.75 # Condensation successes : 0
% 0.44/0.75 # Termbank termtop insertions : 95841
% 0.44/0.75 # Search garbage collected termcells : 26148
% 0.44/0.75
% 0.44/0.75 # -------------------------------------------------
% 0.44/0.75 # User time : 0.097 s
% 0.44/0.75 # System time : 0.024 s
% 0.44/0.75 # Total time : 0.121 s
% 0.44/0.75 # Maximum resident set size: 6464 pages
% 0.44/0.75
% 0.44/0.75 # -------------------------------------------------
% 0.44/0.75 # User time : 0.234 s
% 0.44/0.75 # System time : 0.041 s
% 0.44/0.75 # Total time : 0.275 s
% 0.44/0.75 # Maximum resident set size: 2724 pages
% 0.44/0.75 % E---3.1 exiting
% 1.23/0.75 % E exiting
%------------------------------------------------------------------------------